Fast equation automaton computation

Fast FFT-based bioheat transfer equation computation

This paper describes a modeling method of the tissue temperature evolution over time in hyper or hypothermia. The tissue temperature evolution over time is classically described by Pennes' bioheat transfer equation which is generally solved by a finite difference method. In this paper we will present a method where the bioheat transfer equation can be algebraically solved after a Fourier transf...

Affine Computation and Affine Automaton

We introduce a quantum-like classical computational model, called affine computation, as a generalization of probabilistic computation. After giving the basics of affine computation, we define affine finite automata (AfA) and compare it with quantum and probabilistic finite automata (QFA and PFA, respectively) with respect to three basic language recognition modes. We show that, in the cases of...

Quantum cellular automaton for universal quantum computation

A number of physical systems that are considered for the realization of a universal quantum computer, such as optical lattices 1 or arrays of microlenses 2 , possess a translation symmetry in the arrangement of qubits and their mutual interaction. Quantum cellular automata QCA represent a suitable framework to explore the computational power of such physical systems, because they respect this s...

A Cellular Automaton for Burgers' Equation

A bstract. We study the app roximation of solut ions to the Burgers' equation , an + c!.-(n _n 2) = v a 2 n ilt ilx 2 ilx' (1) by spatially avera ging a prob abilistic cellular automaton motivated by random walks on a line. The auto maton consists of moving "particles" on Q. one-dimensional periodic lattice with spe ed one and in a random direction subject to the exclusion principle that at mos...

Schrödinger equation: Computation